By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 14, Issue 1, pp. 1-141

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Improved Algorithms and Analysis for Secretary Problems and Generalizations

Miklos Ajtai, Nimrod Megiddo, and Orli Waarts

pp. 1-27

BibTeX  Abstract Full Text:  PDF

Labeling Products of Complete Graphs with a Condition at Distance Two

John P. Georges, David W. Mauro, and Melanie I. Stein

pp. 28-35

BibTeX  Abstract Full Text:  PDF

Sufficient Conditions for Two Tree Reconstruction Techniques to Succeed on Sufficiently Long Sequences

Mike Steel

pp. 36-48

BibTeX  Abstract Full Text:  PDF

Compact Representations of Cuts

David Hartvigsen

pp. 49-66

BibTeX  Abstract Full Text:  PDF

Better Approximation Guarantees for Job-Shop Scheduling

Leslie Ann Goldberg, Mike Paterson, Aravind Srinivasan, and Elizabeth Sweedyk

pp. 67-92

BibTeX  Abstract Full Text:  PDF

Enumeration of Equicolorable Trees

Nicholas Pippenger

pp. 93-115

BibTeX  Abstract Full Text:  PDF

A Note on a Question of C. D. Savage

Michael Naatz

pp. 116-120

BibTeX  Abstract Full Text:  PDF

Cyclic Chromatic Number of 3-Connected Plane Graphs

Hikoe Enomoto, Mirko Hornák, and Stanislav Jendrol'

pp. 121-137

BibTeX  Abstract Full Text:  PDF

Approximate Edge Splitting

Michel X. Goemans

pp. 138-141

BibTeX  Abstract Full Text:  PDF